combinatorial optimization造句
例句與造句
- Combinatorial optimization using multi - agent evolutionary algorithm
組合優(yōu)化多智能體進化算法 - On the vehicle dispatching problem in combinatorial optimization
關于組合優(yōu)化中的車輛調度問題 - The solution to decision making of awarding credit assets combinatorial optimization
銀行授信資產(chǎn)組合優(yōu)化決策模型與求解 - A novel algorithm and its convergence for a class of combinatorial optimization problems
一類組合優(yōu)化問題的新解法及其收斂性 - This paper studies the approximation algorithms of some combinatorial optimization problems
本文主要研究組合優(yōu)化中若干問題的近似算法。 - It's difficult to find combinatorial optimization in a sentence. 用combinatorial optimization造句挺難的
- In addition , simulated annealing algorithm for the combinatorial optimization problem here is also given
此外，利用模擬退火算法成功地解決了該組合優(yōu)化問題。 - Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局問題是具有np完備計算復雜度的離散組合優(yōu)化問題。 - We introduce the basic notions of combinatorial optimization and worst - case analysis of algorithms in chapter 1
文章首先介紹了組合優(yōu)化的概貌，給出了近似算法定義及其性能度量標準。 - Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm
成組技術問題是組合優(yōu)化問題,而遺傳算法正是目前求解組合最優(yōu)化的有效方法之一。 - The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem
摘要煉鋼-連鑄生產(chǎn)的澆次組合與排序是帶有工藝約束的并行機流水車間調度問題。 - Three - dimensional component packing is a combinatorial optimization and np - complete problem . it is difficult to find its exact global optimum
三維布局問題屬于組合最優(yōu)化問題和np完全問題，在一定時間內求其精確全局最優(yōu)解是相當困難的。 - ( 4 ) a combinatorial optimization model for process scheme , based on genetic algorithms , is presented , and the corresponding algorithms are designed
( 4 )提出了基于遺傳算法的加工方案組合優(yōu)化方法，建立了加工方案組合優(yōu)化的數(shù)學模型。 - The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem . it is difficult to solve the problem
鐘手表機芯設計中齒輪參數(shù)的優(yōu)化設計問題是一個組合優(yōu)化問題,很難用傳統(tǒng)優(yōu)化方法解決。 - Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs
排序問題研究的是若干個任務要在一些機器上進行加工，如何安排機器和任務使得某些要求(目標函數(shù))達到最優(yōu)的問題。 - Firstly , the cardinal theories of markov random field , map - mrf based image classification algorithm and the combinatorial optimization methods during its implementation are elaborated
在詳細討論markov隨機場基本理論的基礎上，論述了基于map - mrf框架的圖像分類算法及該算法實現(xiàn)過程中的組合優(yōu)化問題。
更多例句： 下一頁